Probabilistic reachability for parametric Markov models
نویسندگان
چکیده
منابع مشابه
Probabilistic Reachability Analysis for Structured Markov Decision Processes
We present a stochastic planner based on Markov Decision Processes (MDPs) that participates to the probablistic planning track of the 2004 International Planning Competition. The planner transforms the PDDL problems into factored MDPs that are then solved with a structured policy iteration algorithm. A probabilistic reachability analysis is performed, approximating the MDP solution over the rea...
متن کاملReachability in Parametric Interval Markov Chains Using Constraints
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the transition probability values: transitions in pIMCs are labeled with parametric intervals of probabilities. In this work, we study the difference between pIMCs and other Markov Chain abstractions models and investigat...
متن کاملParametric Hidden Markov Models for Gesture Recognition
ÐA new method for the representation, recognition, and interpretation of parameterized gesture is presented. By parameterized gesture we mean gestures that exhibit a systematic spatial variation; one example is a point gesture where the relevant parameter is the two-dimensional direction. Our approach is to extend the standard hidden Markov model method of gesture recognition by including a glo...
متن کاملNonlinear Parametric Hidden Markov Models
In previous work [4], we extended the hidden Markov model (HMM) framework to incorporate a global parametric variation in the output probabilities of the states of the HMM. Development of the parametric HMM was motivated by the task of simultaneoiusly recognizing and interpreting gestures that exhibit meaningful variation. With standard HMMs, such global variation confounds the recognition proc...
متن کاملReachability for Dynamic Parametric Processes
In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynamic parametric processes is decidable under mild assumptions. These assumptions are e.g. met if individual processes are realized by pushdown systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2010
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-010-0146-x